Scheduling task-trees with additive scales on parallel/distributed machines

Scheduling Task-Tree with Additive Scales on Parallel / Distributed Machines

We consider a family of jobs that are organized as a task-tree which, in particular, captures the behavior of divide-and-conquer algorithms in many typical cases (examples are QuickSort and Brute-Force Search jobs). These jobs can be described as a rooted task tree, where the cost of work at a node v in the tree is additive in the cost of v’s children. We give a lower bound on the time to perfo...

Scheduling Malleable Task Trees

Solving sparse linear systems can lead to processing tree workflows on a platform of processors. In this study, we use the model of malleable tasks motivated in [1, 9] in order to study tree workflow schedules under two contradictory objectives: makespan minimization and memory minization. First, we give a simpler proof of the result of [8] which allows to compute a makespan-optimal schedule fo...

Scheduling balanced task-graphs to LogP-machines

This article discusses algorithms for scheduling task graphs G V E to LogP machines These algorithms depend on the granularity of G i e on the ratio of computation v and communication times in the LogP cost model and on the structure of G We de ne a class of coarse grained task graphs that can be scheduled with a performance guarantee of Topt G where Topt G is the time required for the optimal ...

Low Latency Task Scheduling Mechanism on Xen Virtual Machines

In virtual machine environments, latency-sensitive tasks are difficult to support in a timely manner, especially when many domains have boosted priorities. Our approach considers where multiple domains compete CPU resource with several I/O intensive domains. This results in increased latency for time-sensitive domains, because the credit scheduler is not aware of the urgency of tasks within dif...

Additive Scales